Elementary affine $lambda$-calculus with multithreading and side effects
نویسندگان
چکیده
Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this frameworkto programs with multithreading and side effects focusing on the case ofelementary time. Our main contributions are as follows. First, we providea new combinatorial proof of termination in elementary time for the func-tional case. Second, we develop an extension of the approach to a call-by-value λ-calculus with multithreading and side effects. Third, we introducean elementary affine type system that guarantees the standard subject re-duction and progress properties. Finally, we illustrate the programmingof iterative functions with side effects in the presented formalism.∗Work partially supported by project ANR-08-BLANC-0211-01 “COMPLICE” and theFuture and Emerging Technologies (FET) programme within the Seventh Framework Pro-gramme for Research of the European Commission, under FET-Open grant number: 243881(project CerCo).
منابع مشابه
An Elementary Affine λ-Calculus with Multithreading and Side Effects
Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main contributions are as follows. First, we introduce a modal call-by-value λ-calculus with multithreading and side effects. Second, we provide a combinatorial pro...
متن کاملElementary Affine Logic and the Call-by-Value Lambda Calculus
Light and elementary linear logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic, as discussed in [1]. In this paper, we show that shifting from usual call-by-name to call-by-value lambda calculus allows to regain strong connections with the underl...
متن کاملA polynomial time {\lambda}-calculus with multithreading and side effects
The framework of light logics has been extensively studied to control the complexity of higher-order functional programs. We propose an extension of this framework to multithreaded programs with side effects, focusing on the case of polynomial time. After introducing a modal λ-calculus with parallel composition and regions, we prove that a realistic call-by-value evaluation strategy can be comp...
متن کاملPrincipal Typing for Lambda Calculus in Elementary Affine Logic
Elementary Affine Logic (EAL) is a variant of Linear Logic characterizing the computational power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assigning to terms of λ-calculus EAL formulas as types. This problem, restricted to the propositional fragment of EAL, is proved to be decidable, and an algorithm is shown, building, for every ...
متن کاملLight Logics and the Call-by-Value Lambda Calculus
The so-called light logics [13, 1, 2] have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic, as discussed in [6]. In this paper we show that shifting from usual call-by-name to call-by-value lambda calculus allows regaining strong connections with the unde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011